Discovery of forwarders to mitigate asymmetric links in a multicast group

ABSTRACT

One embodiment of the present invention sets forth a technique for establishing communications within a multicast group of nodes included in a mesh network. The technique includes detecting that a first message related to the member node joining the multicast group has not been received from a multicast group leader included in the multicast group. The technique also includes in response, generating a first broadcast message for the member node that includes a multicast join request. The technique further includes forwarding the first broadcast message to one or more nodes included in the mesh network that are direct neighbors of the member node, wherein at least one node included in the one or more nodes further forwards the first broadcast message based on a first maximum hop limit.

BACKGROUND Field of the Various Embodiments

Embodiments of the present disclosure relate generally to computerscience and networking, and more specifically, to discovery offorwarders to mitigate asymmetric links in a multicast group.

Description of the Related Art

A conventional utility distribution infrastructure typically includesmultiple consumers (e.g., houses, business, etc) coupled to a set ofintermediate distribution entities. The distribution entities drawresources from upstream providers and distribute the resources to thedownstream consumers. In a modern utility distribution infrastructure,the consumers and/or intermediate distribution entities may includeInternet-of-Things (IoT) devices, such as smart utility meters and othernetwork-capable hardware. Among other things, these IoT devices measurethe consumption levels of various resources to generate relatedmetrology data and periodically report the metrology data across theInternet and/or other networks to a centralized management facility,often referred to as the “back office.”

In many cases, the back office performs various management operationsfor the utility distribution infrastructure on behalf of one or morecustomers. For example, a customer could include a utility company oranother corporate entity that owns and/or operates all of or part of theutility distribution infrastructure. Typically, the back officeperiodically collects metrology data associated with the utilitydistribution infrastructure and provides that data to customers. Forexample, the back office could obtain metrology data from a set of IoTdevices every eight hours indicating utility consumption over aneight-hour interval. The back office also occasionally initiateson-demand read requests to read metrology data from one or more specificIoT device at the behest of the customer. For example, the customercould require a final utility meter reading from a smart utility meterlocated at a recently sold residence to prorate a utility bill. In sucha situation, the back office would transmit an on-demand read request tothat smart meter to cause the smart meter to report the current meterreading.

In some implementations, instead of communicating with one anotherindirectly through the back office, a group of IoT devices may establishan ad hoc mesh network to enable more direct device-to-devicecommunications. Such a mesh network is typically formed by establishingcommunication links between pairs of IoT devices that reside relativelyclose to one another. The mesh network is then used by the IoT devicesto exchange and/or aggregate metrology data, propagate commands, and/orparticipate in other local decisions or actions. These types of directcommunications among IoT devices within a mesh network are normallyconducted based on multicast traffic protocols within a multicast group.For example, smart meters that belong to the same transformer in a powergrid could form a multicast group and communicate with one another viadifferent multicast exchanges between members of the multicast group.

One drawback to communicating via multicast groups, however, is that IoTdevices in the same multicast group may reside in different areanetworks (e.g., by connecting to different access points or cellulartowers). In such situations, network routes between two IoT devices inthe multicast group may span multiple area networks and include nodesthat are not part of the multicast group. Because IoT devices in themulticast group cannot communicate with one another using networkstructures under which the IoT devices are organized, such as atree-based hierarchy of IoT devices within a single area network,members of the multicast group may exchange multicast messages with oneanother by flooding the mesh network. However, flooding the mesh networkwith multicast messages causes the multicast messages to be processedand forwarded by a much larger set of nodes than is required to connectthe members of the multicast group. This amount of processing andforwarding consumes a substantial amount of bandwidth in the meshnetwork and increases overall resource overhead on the IoT device, whichcan substantially reduce device battery life.

As the foregoing illustrates, what is needed in the art are moreeffective techniques for efficiently establishing and conductingcommunication among members of a multicast group that reside acrossmultiple networks.

SUMMARY

One embodiment of the present invention sets forth a technique forestablishing communications within a multicast group of nodes includedin a mesh network. The technique includes detecting that a first messagerelated to the member node joining the multicast group has not beenreceived from a multicast group leader included in the multicast group.The technique also includes in response, generating a first broadcastmessage for the member node that includes a multicast join request. Thetechnique further includes forwarding the first broadcast message to oneor more nodes included in the mesh network that are direct neighbors ofthe member node, wherein at least one node included in the one or morenodes further forwards the first broadcast message based on a firstmaximum hop limit.

One technical advantage of the disclosed techniques relative to theprior art is that the disclosed techniques enable a minimum set ofmulticast forwarders to be identified within a multicast group, wherethe multicast forwarders in that minimum set are able to connect allmember nodes included in the multicast group. Accordingly, the disclosedtechniques are able to reduce bandwidth consumption and overallprocessing overhead typically associated with conventional approaches.The disclosed techniques also transmit unicast messages during themulticast discovery process when possible, which further reducesbandwidth consumption and processing overhead. These technicaladvantages provide one or more technological improvements over prior artapproaches.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the variousembodiments can be understood in detail, a more particular descriptionof the inventive concepts, briefly summarized above, may be had byreference to various embodiments, some of which are illustrated in theappended drawings. It is to be noted, however, that the appendeddrawings illustrate only typical embodiments of the inventive conceptsand are therefore not to be considered limiting of scope in any way, andthat there are other equally effective embodiments.

FIG. 1 illustrates a network system configured to implement one or moreaspects of various embodiments.

FIG. 2 illustrates a node configured to transmit and receive data withinthe network system of FIG. 1, according to various embodiments.

FIG. 3A illustrates an initial state of a set of nodes in an exemplarmesh network, according to various embodiments.

FIG. 3B illustrates a first step in a multicast discovery processperformed by the set of nodes in the exemplar mesh network of FIG. 3A,according to various embodiments.

FIG. 3C illustrates a second step in a multicast discovery processperformed by the set of nodes in exemplar the mesh network of FIG. 3A,according to various embodiments.

FIG. 3D illustrates a third step in a multicast discovery processperformed by the set of nodes in the exemplar mesh network of FIG. 3A,according to various embodiments.

FIG. 4A illustrates an initial state of a set of nodes in an exemplarmesh network, according to other various embodiments.

FIG. 4B illustrates a first step in a multicast discovery processperformed by the set of nodes in the exemplar mesh network of FIG. 4A,according to other various embodiments.

FIG. 4C illustrates a transmission failure during a second step in amulticast discovery process performed by the set of nodes in theexemplar mesh network of FIG. 4A, according to other variousembodiments.

FIG. 4D illustrates a first step performed to resolve the transmissionfailure of FIG. 4C, according to other various embodiments.

FIG. 4E illustrates a second step performed to resolve the transmissionfailure of FIG. 4C, according to other various embodiments.

FIG. 5 is a flow diagram of method steps for establishing communicationswithin a multicast group of nodes included in a mesh network, accordingto various embodiments.

FIG. 6 is a flow diagram of method steps for establishing communicationswithin a multicast group of nodes included in a mesh network, accordingto other various embodiments.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth toprovide a more thorough understanding of the various embodiments.However, it will be apparent to one of skilled in the art that theinventive concepts may be practiced without one or more of thesespecific details.

System Overview

FIG. 1 illustrates a network system 100 configured to implement one ormore aspects of various embodiments. As shown, network system 100includes a field area network (FAN) 110, a wide area network (WAN)backhaul 120, and a control center 130. FAN 110 is coupled to controlcenter 130 via WAN backhaul 120. Control center 130 is configured tocoordinate the operation of FAN 110.

FAN 110 includes personal area network (PANs) A, B, and C. PANs A and Bare organized according to a mesh network topology, while PAN C isorganized according to a star network topology. It will be appreciatedthat PANs A, B, or C can be organized according to other networktopologies or structures. For example, one or more PANs could beconfigured in a tree-like network structure, such as a DestinationOriented Directed Acyclic Graph (DODAG) with parent nodes, child nodes,and a root node.

Each of PANs A, B, and C includes at least one border router node 112and one or more mains powered device (MPD) nodes 114. PANs B and Cfurther include one or more battery powered device (BPD) nodes 116.

MPD nodes 114 draw power from an external power source, such as mainselectricity or a power grid. MPD nodes 114 typically operate on acontinuous basis without powering down for extended periods of time. BPDnodes 116 draw power from an internal power source, such as a battery.BPD nodes 116 typically operate intermittently and power down forextended periods of time in order to conserve battery power. MPD nodes114 and BPD nodes 116 are configured to gather sensor data, process thesensor data, and communicate data processing results and otherinformation to control center 130. Border router nodes 112 operate asaccess points to provide MPD nodes 114 and BPD nodes 116 with access tocontrol center 130.

Nodes may transmit data packets across a given PAN and across WANbackhaul 120 to control center 130. Similarly, control center 130 maytransmit data packets across WAN backhaul 120 and across any given PANto a particular node included therein. As a general matter, numerousroutes may exist which traverse any of PANs A, B, and C and include anynumber of intermediate nodes, thereby allowing any given node or othercomponent within network system 100 to communicate with any other nodeor component included therein. However, these routes are generally notknown by the nodes unless a dedicated protocol is implemented by thenodes, in addition to the protocol used to manage each PAN. Conversely,routes that link nodes within a given PAN are typically known (e.g., viathe protocol used to manage the PAN) by the nodes in the PAN and allownodes within the PAN to communicate with one another.

Control center 130 includes one or more server machines (not shown)configured to operate as sources for, or destinations of, data packetsthat traverse within network system 100. The server machines may querynodes within network system 100 to obtain various data, including raw orprocessed sensor data, power consumption data, node/network throughputdata, status information, and so forth. The server machines may alsotransmit commands and/or program instructions to any node within networksystem 100 to cause those nodes to perform various operations. In oneembodiment, each server machine is a computing device configured toexecute, via a processor, a software application stored in a memory toperform various network management operations.

Any of border router nodes 112, MPD nodes 114, and BPD nodes 116additionally include functionality to communicate directly with one ormore adjacent nodes via bi-directional communication links. Thecommunication links may be wired or wireless links, although inpractice, adjacent nodes of a given PAN or across multiple PANs exchangedata with one another by transmitting data packets via wireless radiofrequency (RF) communications.

Each node within a given PAN may implement a discovery protocol toidentify one or more adjacent nodes, or “neighbors.” A node that hasidentified a spatially adjacent, neighboring node may establish abi-directional communication link with the neighboring node. Forexample, a node that is discovered another node could exchange mediaaccess control (MAC) addresses and schedule future communications withthe other node based on those MAC addresses. Each neighboring node couldupdate a respective neighbor table to include information concerning theother node, including the MAC address of the other node as well as areceived signal strength indication (RSSI) of the communication linkestablished with that node.

In one embodiment, nodes may implement the discovery protocol todetermine the hopping sequences of adjacent nodes. The hopping sequenceof a node is the sequence of RF channels across which the nodeperiodically receives data. As is known in the art, a channel maycorrespond to a particular range of frequencies.

Once adjacency is established between nodes, any of those nodes cancommunicate with any of the other nodes via one or more intermediatenodes and one or more communications links associated with theintermediate node(s). In other words, communication links betweenadjacent nodes that have discovered one another may be used by the nodesto form a mesh network, independent of network topologies or structuresassociated with individual PANs A, B, or C. Nodes in the mesh networkmay additionally communicate with one another via the communicationlinks in the mesh network instead of relying on the network structuresand/or connections in WAN backhaul 120 or PANs A, B, or C. For example,communications links established between one or more nodes in PAN A andone or more nodes in PAN B, and between one or more nodes in PAN B andone or more nodes in PAN C, could be used to transmit Internet protocol(IP) packets, command messages, metrology data, and/or other technicallyfeasible data units between or among nodes in the mesh network withoutrouting the data through WAN backhaul 120.

In some embodiments, a subset of nodes in the mesh network is added to amulticast group to communicate specific information with one another.Membership of nodes in the multicast group may additionally beindependent of the grouping of nodes under multiple PANs A, B, and C.For example, nodes that include smart meters grouped under the sametransformer in a power grid could form a multicast group and communicatewith one another by transmitting multicast messages within the multicastgroup. These multicast messages could be used by the nodes to exchangeor aggregate metrology data, propagate commands, or carry out otherdecisions or actions while minimizing or avoiding communication withcontrol center 130.

Any of the nodes discussed above may operate as a source node, anintermediate node, or a destination node for the transmission of datapackets. A given source node may generate a data packet and thentransmit the data packet to a destination node via any number ofintermediate nodes (in mesh network topologies). The data packet mayindicate a destination for the packet and/or a particular sequence ofintermediate nodes to traverse to reach the destination node. In oneembodiment, each intermediate node may include a forwarding databaseindicating various network routes and cost metrics associated with eachroute.

Nodes may include computing device hardware configured to performprocessing operations and execute program code. Each node may furtherinclude various analog-to-digital and digital-to-analog converters,digital signal processors (DSPs), harmonic oscillators, transceivers,and any other components generally associated with RF-basedcommunication hardware. FIG. 2 illustrates an exemplary node that mayoperate within the network system 100.

FIG. 2 illustrates a node 200 configured to transmit and receive datawithin the mesh network of FIG. 1, according to various embodiments.Node 200 may be used to implement any of border router nodes 112, MPDnodes 114, and BPD nodes 116 of FIG. 1.

As shown, a node 200 includes a computing device 210. Computing device210 includes one or more processors 220, a battery 204, one or moretransceivers 206, and a memory 216 coupled together. Processors 220 mayinclude any hardware configured to process data and execute softwareapplications. For example, processors 202 could include one or morecentral processing units (CPUs), graphics processing units (CPUs),application-specific integrated circuit (ASICs), field programmable gatearray (FPGAs), artificial intelligence (AI) accelerators,microprocessors, microcontrollers, other types of processing units,and/or a combination of different processing units (e.g., a CPUconfigured to operate in conjunction with a GPU).

Transceivers 206 are configured to transmit and receive data packetsacross network system 100 using a range of channels and power levels.Each transceiver includes one or more radios implemented in hardwareand/or software to provide two-way RF communication with other nodes innetwork system 100 via one or more communications links 214.Transceivers 206 may also, or instead, include a cellular modem that isused to transmit and receive data with a cellular base station via acorresponding link.

Battery 204 supplies power to processors 220, transceivers 206, memory216, and/or other components of computing device 210. For example,battery 204 could include sufficient capacity to allow computing device210 to operate for a number of years without replacement and/orrecharging. In some embodiments, power from battery 204 is supplementedwith or replaced by a mains power supply, a solar panel, and/or anotherpower source.

Memory 216 includes one or more units that store data and/orinstructions. For example, memory 216 could include a random accessmemory (RAM) module, a flash memory unit, and/or another type of memoryunit. Processors 220, transceivers 206, and/or other components of node112 include functionality to read data from and write data to memory116. Memory 216 includes software application 222, which includesprogram code that, when executed by one or more processors 220, performsany of the operations discussed herein.

In operation, software application 242 performs a neighbor discovery 228process discussed above in conjunction with FIG. 1 in order to establishadjacency with one or more neighboring nodes in a mesh network. Softwareapplication 242 may generate a neighbor table that indicates nodeadjacency and other data related to the nodes in the mesh network andstore the neighbor table in database 244.

Software application 242 may also store, in database 244 and/or memory216, data related to one or more roles within multicast groups of nodesin the mesh network. These roles include, but are not limited to, amulticast group leader of a multicast group, a multicast group member ofthe multicast group, and/or a multicast forwarder that propagatesmulticast messages among members of the multicast group. The roles ofmulticast leader and multicast group members for a given multicast groupmay be added to database 244 and/or memory 216 based on a configurationby control center 130, a multicast group membership discovery protocol,and/or another technically feasible technique.

In some embodiments, software application 242 participates in amulticast discovery 230 process with neighboring nodes identified duringneighbor discovery 228. During multicast discovery 230, a subset ofnodes in the mesh network is assigned the role of multicast forwarderfor a given multicast group. Multicast messages may then be transmittedamong the members of the multicast group along paths that include themulticast forwarders. In other words, multicast discovery 230 may beused to establish communication within the multicast group using links214 between adjacent nodes instead of requiring coordination withcontrol center 130 and/or another central agent or utilizing tree-basednetwork structures under which the nodes are organized.

More specifically, multicast discovery 230 may include a three-wayhandshake that is initiated by the multicast group leader of themulticast group. The three-way handshake includes a multicastadvertisement message from the multicast group leader to members of themulticast group, multicast join requests from the members to themulticast group leader, and a multicast acknowledgment from the leaderto each member from which a multicast join request was received. Datathat is accumulated and transmitted during the three-way handshake maythen be used to select multicast forwarders for the multicast group, asdiscussed in further detail below with respect to FIGS. 3A-3D. To reduceprocessing overhead and/or bandwidth consumption during multicastdiscovery 230, unicast messages may be used during one or more steps ofthe three-way handshake.

When a node fails to receive a unicast message during the three-wayhandshake, multicast discovery 230 may fall back to broadcasttransmission of one or more messages to or from the node, as discussedin further detail below with respect to FIGS. 4A-4F. The broadcasttransmission may allow multicast forwarders and paths between multicastmembers in the multicast group to be established in the presence ofasymmetric links and/or other connectivity issues between nodes in themesh network.

Multicast Discovery in a Mesh Network

FIG. 3A illustrates an initial state of a set of nodes in an examplemesh network, according to various embodiments. As shown, the meshnetwork includes 28 nodes that are grouped under three PANs. The firstPAN includes nodes A, H, O, W, and X connected to a first router 302.The second PAN includes nodes B, C, D, E, I, J, K, Q, R, S, T, Y, and Zconnected to a second router 304. The third PAN includes nodes F, G, L,M N, U, V, AA, AB, and AC connected to a third router 306.

Nodes in each PAN are arranged in a tree-based network structure, whichincludes a hierarchy of parent and child nodes. Within the first PAN,nodes H and O are children of router 302, node A is a child of node H,and nodes W and X are children of node O. Within the second PAN, nodes Cand D are children of router 304; nodes B, I, and J are children of nodeC; nodes E and K are children of node D; node Q is a child of node I;node R is a child of node J; nodes S and T are children of node K; andnodes Y and Z are children of node R. Within the third PAN, node AC is achild of router 306; nodes U and V are children of node AC; nodes L, M,and AB are children of node U; node N is a child of node V; node AA is achild of node AB; and nodes F and G are children of node N.

Nodes that are spatially adjacent in FIG. 3A are additionally connectedby communication links in the mesh network. For example, node A couldinclude communication links with adjacent nodes B, J, and I; node Jcould include communication links with adjacent nodes B, C, D, I, K, Q,R, and S; and so on. A first node that is adjacent to (and thus has adirect communication link with) a second node is referred to as a directneighbor of the second node. A given node in the mesh network is able toforward unicast and broadcast frames to the node's direct neighbors viathe corresponding communication links.

Within the mesh network, nodes A, B, F, J, Q, and AA (shown as filled inFIG. 3A) are configured as members of a multicast group, and node J(shown as larger than the other nodes in FIG. 3A) is configured as themulticast group leader of the multicast group. This configuration orselection of the multicast group leader and multicast group members maybe performed using a centralized entity, a discovery process, and/oranother technically feasible technique.

FIG. 3B illustrates a first step in a multicast discovery processperformed by the set of nodes in the example mesh network of FIG. 3A,according to various embodiments. As shown, the first step includes nodeJ broadcasting a multicast advertisement message (MAM) for the multicastgroup, which reaches other nodes A, B, F, Q, and AA in the multicastgroup. In some embodiments, node J periodically rebroadcasts a new MAM(e.g., every 30 minutes, every hour, every 12 hours, etc.) to maintainthe multicast group.

First, node J generates the MAM with a maximum hop limit, a path cost, asequence counter, and/or other metadata. In the example illustrated inFIG. 3B, the MAM is initialized using a maximum hop limit of 3 and apath cost of zero.

Next, node J forwards the MAM to all direct neighbors, which includenodes B, C, D, I, K, Q, R, and S. Each node that receives the MAMforwards the broadcast frame to all of the node's direct neighbors aftera random forwarding delay. Prior to forwarding the MAM, a given nodedecrements the hop limit in the MAM and appends the node's networkaddress (e.g., IP address, Media Access Control (MAC) address, etc.) tothe end of an address vector in the MAM.

A given node that receives the MAM may also calculate an updated pathcost based on an aggregated expected transmission count (ETX), expectedtransmission time (ETT), hop count, and/or another routing metricassociated with transmission of the MAM from node J to the node andinclude the updated path cost in the MAM (in lieu of the previous pathcost calculated by a neighbor node from which the MAM was received). Forexample, the node could calculate a link cost associated with receipt ofthe MAM from the neighbor and calculate the updated path cost as the sumof the link cost and the value of path cost in the MAM from the neighbornode. If more than one MAM is received by the node before the end of theforwarding delay, the node selects the address vector associated withthe best path cost (e.g., based on a routing metric or combination ofrouting metrics) for inclusion in the MAM that is forwarded to thenode's direct neighbors.

Forwarding of the MAM stops after a node receives the MAM with a hoplimit of 0 and/or if the node has already and made a forwarding decisionfor an MAM with the same sequence counter. In some instances, a nodethat has already forwarded an MAM with a given sequence counter maychoose to re-forward a newly received MAM with the given sequencecounter when the newly received MAM is associated with a better pathcost than the forwarded MAM. As the multicast group leader, node J doesnot forward any MAMs for the multicast group that originated from nodeJ.

In FIG. 3B, shortest paths along which the MAM is transmitted from nodeJ to member nodes A, B, F, Q, and AA are illustrated using arrows thatconnect pairs of adjacent nodes. In some embodiments, a shortest path isa path with the lowest or best path cost between two nodes. As mentionedabove, this path cost may be calculated using one or more routingmetrics, such as (but not limited to) hop count, ETX, ETT, bandwidth,error rate, and/or delay. Additional paths used to broadcast the MAMwithin the mesh network are omitted for clarity. Each arrow isadditionally labeled with a representation of the address vector in theMAM, as transmitted from a first node from which the arrow originatesand received by a second node at which the arrow terminates. All pathsdenoted by the arrows fall within the maximum hop limit of 3 from nodeJ.

In particular, each MAM originating from node J has an address vectorthat includes only node J and a hop limit of 2 (since the first hop fromnode J to each of its direct neighbors is decremented from the maximumhop limit of 3 before the MAM is transmitted by node J). This originalMAM reaches member nodes B and Q, which determine that the addressvector in the MAM from node J is shorter than other address vectors inMAMs received via other paths.

Node B appends its network address to the shortest address vector in theMAM from J, decrements the hop limit in the MAM, updates the path costin the MAM based on the link cost with J, and forwards the MAM to alldirect neighbors. Node A receives the MAM from node B, which includes ahop limit of 1 and an address vector with the addresses of nodes J andB. Node A may optionally receive the MAM via other paths that fallwithin the maximum hop limit (e.g., via nodes C and B, nodes I and B,nodes I and H, etc.) and determine that the MAM routed through that paththat includes nodes J and B has the best path cost. Node A may alsotransmit the MAM with a hop count of zero and an address vector thatincludes the addresses of nodes J, B, and A to its direct neighbors,which include nodes B, H, and I. Since node B already has an MAM fromnode J with a better path cost and nodes H and I are not members of themulticast group, transmission of the MAM from node A to neighboringnodes is omitted in the depiction of FIG. 3B.

The MAM also reaches nodes D and S, which are not members of themulticast group. Each of nodes D and S determines that the path cost inthe original MAM from node J is better than the path costs in MAMsreceived via other paths. Each of nodes D and S appends their networkaddresses to the address vector in the MAM, decrements the hop limit inthe MAM, and transmits the MAM to all direct neighbors.

Node AA receives the MAM from node S with an address vector thatincludes the addresses of nodes J and S and a hop limit of 1. Node AAdetermines that this MAM has the best path cost of all MAMs received bynode AA, adds its address to the address vector, decrements the hoplimit in the MAM to zero, and transmits the MAM to all direct neighbors.Since none of the direct neighbors of node AA are members of themulticast group, depictions of these transmissions are omitted in FIG.3B.

Node E receives the MAM from node D with an address vector that includesthe addresses of nodes J and D and a hop limit of 1. Node E determinesthat this MAM has the best path cost of all MAMs received by node E,decrements the hop limit in the MAM, and transmits the MAM to all directneighbors. Node F receives the MAM from node E and does not furtherforward the MAM because the hop limit in the MAM is zero. Thus, afterbroadcasting of the MAM is complete, each of member nodes A, B, F, Q,and AA has an address vector with the shortest path (as determined basedon path cost) to the multicast group leader of node J.

FIG. 3C illustrates a second step in a multicast discovery processperformed by the set of nodes in the example mesh network of FIG. 3A,according to various embodiments. As shown, the second step includeseach of member nodes A, B, F, Q, and AA responding to the MAM from nodeJ with a multicast join request (MJR). Each MJR includes a sourcerouting header (SRH) that specifies the route to be taken by the MJR andis transmitted via unicast along nodes with network addresses in theSRH. A member node builds the SRH using the shortest path address vectorin one or more MAMs received from node J.

In general, each of member nodes A, B, F, Q, and AA creates a separateMJR with information that can be used to route the MJR to node J. Amember node may create an SRH for an MJR from the member node byappending addresses to the SRH in reverse order from the shortest pathMAM address vector received by the member node from node J. Each ofmember nodes A, B, F, Q, and AA may also add its own address to a“source” field in the frame for the MJR. If node J is adjacent to agiven member node (e.g., nodes B and Q), the member node may omit theSRH and transmit the MJR as a local unicast message addressed to node J.

Using the technique described above, node A creates an SRH that includesthe addresses of nodes B and J (in that order), includes the SRH in anMJR, and adds the address of node A to a separate part of the frame forthe MJR. Node A transmits the MJR via unicast to node B, and node B usesthe SRH in the MJR to forward the MJR to node J.

Node B creates a MJR that lacks an SRH and transmits the MJR directly tonode J. Node Q similarly creates an MJR that lacks an SRH and transmitsthe MJR directly to node J.

Node AA creates an MJR with an SRH that includes the addresses of S andJ (in that order) and includes the address of node AA in a separate partof the frame for the MJR. Node AA transmits the MJR to node S, and nodeS uses the SRH in the MJR to forward the MJR to node J.

Node F creates an MJR with an SRH that includes the addresses of nodesE, D, and J (in that order). Node F also adds the address of node F to aseparate part of the frame for the MJR. Node F transmits the MJR to nodeE, and node E uses the SRH in the MJR to forward the MJR to node D. NodeD then uses the SRH in the MJR to forward the MJR to node J.

FIG. 3D illustrates a third step in a multicast discovery processperformed by the set of nodes in the example mesh network of FIG. 3A,according to various embodiments. As shown, the third step includes nodeJ responding to each MJR received in the second step of the multicastdiscovery process with a multicast join acknowledgment (MJA). Each MJAincludes an SRH that is built by reversing the SRH of the MJR from thecorresponding member node. Each MJA is additionally transmitted viaunicast from node J to the corresponding member node.

Using the technique described above, node J creates a first MJA inresponse to the MJR from node A. The SRH in the first MJA includes theaddresses of nodes B and A (in that order). Node J includes its ownaddress in a different part of the frame for the MJA and transmits thefirst MJA to node B, and node B uses the SRH in the first MJA to forwardthe first MJA to node A.

Node J also creates a second MJA that lacks an SRH in response to theMJR from node B. Node J then transmits the second MJA directly to nodeB.

Node J similarly creates a third MJA that lacks an SRH in response tothe MJR from node Q. Node J then transmits the third MJA directly tonode Q.

Node J creates a fourth MJA in response to the MJR from node AA. The SRHin the fourth MJR includes the addresses of nodes S and AA (in thatorder). Node J includes its own address in a different part of the framefor the MJA and transmits the fourth MJA to node S, and node S uses theSRH in the fourth MA to forward the fourth MJA to node AA.

Node J creates a fifth MJA in response to the MJR from node F. The SRHin the fifth MJR includes the addresses of nodes D, E, and F (in thatorder). Node J includes its own address in a different part of the framefor the MJA and transmits the fifth MJA to node D, and node D uses theSRH in the fifth MJA to forward the fifth MJA to node E. Node E alsouses the SRH in the fifth MJA to forward the fifth MJA to node F.

After an MJA has been transmitted by a given node (including themulticast group leader), the node declares itself a multicast forwarderfor the multicast group. Each declared multicast forwarder may then beused to efficiently route multicast traffic among member nodes in themulticast group. As the multicast group leader, node J may maintain alist of the multicast forwarders in the multicast group and/or providethe list to other member nodes in the multicast group.

In the example of FIGS. 3A-3D, nodes B, J, D, E, and S (shown as circledin FIG. 3D) are identified as multicast forwarders for the multicastgroup with member nodes A, B, E, F, J, Q, and AA. These nodes form aminimum set of multicast forwarders that connects member nodes in themulticast group. As shown in FIGS. 3A-3D, member nodes in the multicastgroup are not all required to be multicast forwarders, and multicastforwarders for the multicast group are not all required to be membernodes in the multicast group.

A given node may additionally be declared as a multicast forwarder for apredefined duration, which is greater than the periodicity of the MAMbroadcasted by node J. For example, nodes B, D, E, J, and S may declarethemselves multicast forwarders for a period of 12-24 hours, while nodeJ may broadcast a new MAM for the multicast group every 8-10 hours. Thislonger duration over which a given node is declared as a multicastforwarder allows multicast traffic to continue to be delivered withinthe multicast group while a new set of multicast forwarders isestablished in response to the latest MAM. Conversely, the multicastdiscovery process may be periodically repeated in the multicast groupvia the MAM/MJR/MJA handshake to maintain an up-to-date representationof member nodes in the multicast group and a set of multicast forwardersthat can be used to route multicast traffic among the member nodes.

FIG. 4A illustrates an initial state of a set of nodes in an examplemesh network, according to other various embodiments. As shown, theexample mesh network of FIG. 4A includes an initial state that isidentical to the initial state of the mesh network of FIG. 3A. That is,the mesh network of FIG. 4A includes 28 nodes total grouped under threePANs. The first PAN includes nodes A, H, O, W, and X connected to afirst router 402. The second PAN includes nodes B, C, D, E, I, J, K, Q,R, S, T, Y, and Z connected to a second router 404. The third PANincludes nodes F, G, L, M N, U, V, AA, AB, and AC connected to a thirdrouter 406.

Nodes within a given PAN are organized in a tree-based networkstructure, as described above with respect to FIG. 3A. Nodes that arespatially adjacent are also connected by communication links in the meshnetwork, and a first node that is adjacent to (and thus has a directcommunication link with) a second node is referred to as a directneighbor of the second node. A given node in the mesh network is able toforward unicast and broadcast frames to the node's direct neighbors viathe corresponding communication links. Nodes A, B, F, J, Q, and JJ(shown as filled in FIG. 4A) are configured as members of a multicastgroup, and node J (shown as larger than the other nodes in FIG. 4A) isconfigured as the multicast group leader of the multicast group.

FIG. 4B illustrates a first step in a multicast discovery processperformed by the set of nodes in the example mesh network of FIG. 4A,according to other various embodiments. As shown, the first stepillustrated in FIG. 4B is identical to the first step illustrated inFIG. 3B, in which node J broadcasts an MAM to other nodes in the meshnetwork based on a maximum hop limit and/or another routing metric. Eachof member nodes A, B, F, Q, and JJ receives the MAM one or more timesand identifies the shortest address vector in all MAMs received fromdirect neighbors.

FIG. 4C illustrates a transmission failure during a second step in amulticast discovery process performed by the set of nodes in the examplemesh network of FIG. 4A, according to other various embodiments. Morespecifically, FIG. 4C shows the second step in the multicast discoveryprocess of FIG. 3C with a failure by node S to receive the unicast MJRfrom node AA. This failure may be due to an asymmetric link betweennodes S and AA, which allows node AA to receive traffic from node S butprevents node S from receiving some or all traffic from node AA. Theasymmetric link may be caused by noise or interference at node S (forexample), which allows node S to transmit traffic to direct neighborsbut may prevent node S from receiving traffic from some or all directneighbors, such as node AA.

Because of this transmission failure, node AA may fail to receive aunicast MJA from node J in response to the unicast MJR from node AA. Ifnode AA has not received the MJA from node J within a certain period oftime, node AA may retry transmission of the unicast MJR. If node AAstill has not received the unicast MJA from node J after a certainnumber of retries, node AA may initiate an alternative sequence of stepsto complete the MAM/MJR/MJA handshake with node J, as described infurther detail below with respect to FIGS. 4D-4E.

FIG. 4D illustrates a first step performed to resolve the transmissionfailure of FIG. 4C, according to other various embodiments. In theseembodiments, this first step involves node AA broadcasting an MJR, andthe MJR reaching node J via an alternative path that does not includenode S. This step may be performed by node AA after failing to receivean MJA from node J in response to a unicast MJR from node AA that istransmitted to node S. This step may also, or instead, be performed bynode AA if node AA has not been able to receive a MAM from node J.

In particular, node AA may generate a broadcast MJR with a sequencecounter, a maximum hop limit, a path cost, and/or other metadata. Aswith the examples of FIGS. 3A-3D, the maximum hop limit in the exampleof FIG. 4D may be set to 3, and the path cost may be initialized tozero.

If node AA has received one or more MAMs from node J, node AA mayinclude the shortest path address vector from these MAMs in thebroadcast MJR. This shortest path address vector may include theaddresses of nodes J and S (in that order), assuming node AA was able toreceive an MAM via the path that includes nodes J and S.

Node AA also adds a separate address vector that includes only theaddress of node AA to the broadcast MJR. This separate address vector isused to establish one or more new paths from node AA to node J. Node AAadditionally includes a hop limit of 2 in the broadcast MJR (since thefirst hop from node AA to each of its direct neighbors is decrementedfrom the maximum hop limit of 3 before the MJR is transmitted by nodeAA) and transmits the broadcast MJR to all direct neighbors.

As with the MAM broadcasted by the multicast group leader, each nodethat receives the broadcast MJR forwards the broadcast frame to all ofthe node's direct neighbors after a random forwarding delay. Prior toforwarding the MJR, a given node decrements the hop limit in the MJR,updates the path cost in the MJR, and appends the node's network address(e.g., IP address, Media Access Control (MAC) address, etc.) to the endof the address vector that starts with the address of node AA. If morethan one MJR is received by the node before the end of the forwardingdelay, the node selects the address vector that starts with the addressof node AA and is associated with the best routing metric for inclusionin the MJR that is forwarded to the node's direct neighbors.

Forwarding of the broadcast MJR stops after a node receives the MJR witha hop limit of 0 and/or if the node has already and made a forwardingdecision for an MJR with the same sequence counter. In some instances, anode that has already forwarded an MJR with a given sequence counter maychoose to re-forward a newly received MJR with the given sequencecounter when the newly received MJR is associated with a better pathcost than the forwarded MJR. As the multicast group leader, node J doesnot forward any MJRs for the multicast group.

After forwarding of the broadcast MJR is complete, a new path with a hopcount of 3 from node AA to node J is established via nodes T and K. Thepath is shown in arrows that connect nodes AA and T, nodes T and K, andnodes K and J. Each arrow is labeled with a representation of theshortest address vector starting with the address of node A, astransmitted from a first node from which the arrow originates andreceived by a second node at which the arrow terminates. Consequently,successful transmission of the broadcast MJR from node AA to node J iscarried out by transmitting the broadcast MJR with an address vectorthat includes only the address of node AA to node T, forwarding thebroadcast MJR with an updated address vector that includes the addressesof nodes AA and T (in that order) from node T to node K, and forwardingthe broadcast MJR with an updated address vector that includes theaddresses of nodes AA, T, and K (in that order) from node K to node J.

Node J may optionally receive the broadcast MJR via other paths thatfall within the maximum hop limit (e.g., via nodes Z and R). These pathsmay be associated with higher path costs than the path via nodes T andK, resulting in node J identifying the path illustrated in FIG. 4D asthe shortest path between node AA and node J. On the other hand, node Jmay fail to receive the broadcast MJR via node S because of the linkasymmetry between nodes AA and S.

FIG. 4E illustrates a second step performed to resolve the transmissionfailure of FIG. 4C, according to other various embodiments. As shown,this second step includes node J responding to the broadcast MJR fromnode AA with a broadcast MJA. The broadcast MJA includes a source ofnode J, a destination of node AA, a sequence counter, a maximum hoplimit, and/or other metadata. The broadcast MJA also includes an addressvector that is populated using one or more lists of addresses includedin one or more address vectors of the broadcast MJR. These lists mayinclude the shortest path address vector in the original MAM and/or theshortest path address vector in the broadcast MJR from node AA to nodeJ. As a result, the address vector in the broadcast MJA includes node Sfrom the original MAM, as well as nodes T and K from the broadcast MJR.

Each node that receives the broadcast MJA forwards the broadcast frameto all of the node's direct neighbors after a random forwarding delay.Prior to forwarding the MJA, a given node decrements the hop limit inthe MJA. Forwarding of the broadcast MJA stops after a node receives theMJA with a hop limit of 0 and/or if the node has already made aforwarding decision for an MJA with the same sequence counter. The nodemay optionally re-forward a newly received MJR with the given sequencecounter when the newly received MJR is associated with a better pathcost than an already forwarded MJR. Moreover, node AA may omitforwarding of any broadcast MJAs for which node AA is the destination toreduce bandwidth and/or processing overhead in the mesh network.

As shown in FIG. 4E, arrows that connect pairs of nodes indicate pathsalong which the broadcast MJA was successfully forwarded from node AA tonode J. A first path includes nodes J, K, and T (in that order), and asecond path includes nodes J and S (in that order). The broadcast MJAmay successfully be transmitted from node J to node AA through node Sbecause the asymmetric link between nodes AA and S allows node S totransmit to node AA but prevents node AA from reliably transmitting tonode S.

After forwarding of the broadcast MJA to node AA is complete, nodesincluded in the address vector of the MJA are selected as multicastforwarders. In particular, the steps performed with respect to FIGS.4D-4E identify nodes K and T as multicast forwarders for the multicastgroup, in addition to nodes B, J, S, D, and E, which may already beidentified as multicast forwarders via unicast transmission of MJRs andMJAs. The additional multicast forwarders solve the asymmetry issuebetween with nodes AA and S by allowing node AA to reach other membernodes in the multicast network via paths that do not include node S.These multicast forwarders may retransmit any multicast traffic withinthe multicast group, and multicast messages in the multicast group mayinclude a sequence number and hop limit to reduce duplicate transmissionof the multicast messages. These multicast forwarders may also bedeclared for a duration that is greater than a periodicity of themulticast advertisement message broadcasted by the multicast groupleader.

In some embodiments, node J delays transmitting the broadcast MJA tonode AA to answer broadcast MJRs from multiple member nodes at the sametime. In these embodiments, node J aggregates address vectors,destination nodes, and/or other metadata related to the MJRs into asingle broadcast message and transmits the broadcast message toneighboring nodes. The broadcast message is then propagated across themesh network according to the technique described above, therebyallowing MJAs in the broadcast message to reach the intended recipients.

FIG. 5 is a flow diagram of method steps for establishing communicationwithin a multicast group of nodes included in a mesh network, accordingto various embodiments. Although the method steps are described inconjunction with the systems of FIGS. 1-4, persons skilled in the artwill understand that any system configured to perform the method steps,in any order, is within the scope of the present invention.

As shown, software application 242 broadcasts 502 an MAM with a maximumhop limit from a multicast leader of a multicast group. For example,software application 242 executing on a node that is the multicast groupleader could add the node's address to an address vector in the MAM,initialize a path cost in the MAM, set a hop limit in the MAM to reflectthe maximum hop limit, and add a sequence counter to the MAM. Softwareapplication 242 would then forward the MAM to direct neighbors of themulticast group leader. Software application 242 executing in each nodethat receives the MAM would add the node's address to the address vectorin the MAM, decrement the hop limit in the MAM, update the path cost inthe MAM with the link cost of the previous hop, and forward the MAM tothe node's direct neighbors. If multiple MAMs with the same sequencenumber are received at a given node, the node compares the path costsand/or routing metrics in the MAMs and selects the address vectorassociated with the best path cost/routing metric for inclusion in theforwarded MAM. Forwarding of the MAM may stop after a node receives theMAM with a hop limit of 0 and/or if the node has already made aforwarding decision for an MAM with the same sequence counter. Moreover,the multicast group leader does not forward the MAM after the MAM istransmitted back to the multicast group leader from a neighboring node.

Next, software application 242 forwards 504 a first unicast message thatincludes an MJR from each member node in the multicast group to themulticast group leader along a shortest path (i.e., a path with the bestrouting metric) from the member node to the multicast group leader. Forexample, software application 242 executing on each member node couldgenerate a MJR that includes an SRH that specifies the shortest pathfrom the member node to the multicast group leader. The shortest pathmay be selected from address vectors in one or more MAMs received by themember node from the multicast group leader. The SRH could be generatedby adding the address of the member node to the front of SRH andappending addresses to the SRH in reverse order from the shortest MAMaddress vector received by the member node from the multicast groupleader. The MJR would then be forwarded by instances of softwareapplication 242 executing on nodes along the shortest path.

Software application 242 then forwards 506 a second unicast message thatincludes an MJA from the multicast group leader to a correspondingmember node. For example, software application 242 executing on themulticast group leader could generate the MJA in response to each MJRreceived by the multicast group leader from a member node in themulticast group. The MJA includes a SRH that is a reverse of the SRH inthe MJR received from the member node. The MJA would then be forwardedalong nodes in the SRH until the MJA reaches the member node.

Finally, software application 242 declares 508 a node that forwarded thesecond unicast message as a multicast forwarder in the multicast group.For example, software application 242 executing on each node thatforwarded an MJA from the multicast group leader, including themulticast group leader, could declare the node as a multicast forwarderfor a predefined duration. This duration could be longer than theperiodicity with which the multicast group leader broadcasts new MAMs.Software application 242 executing on the multicast group leader wouldalso maintain a list of multicast forwarders based on declarations bythe nodes that forwarded MJAs from the multicast group leader to themember nodes.

Operation 502-508 may be repeated to continue maintaining 510 themulticast group. For example, the multicast group leader could performoperation 502 on a periodic basis to maintain an up-to-daterepresentation of the multicast group and select multicast forwarders inthe multicast group. Additional nodes in the mesh network would thenperform operations 504-508 in response to the MAM broadcasted inoperation 502 to complete the three-way handshake and establishcommunication within the multicast group.

FIG. 6 is a flow diagram of method steps for establishing communicationwithin a multicast group of nodes included in a mesh, according to othervarious embodiments. Although the method steps are described inconjunction with the systems of FIGS. 1-4, persons skilled in the artwill understand that any system configured to perform the method steps,in any order, is within the scope of the present invention.

As shown, software application 242 detects 602 that a first messagerelated to a member node joining a multicast group has not been receivedfrom a multicast group leader in the multicast group. For example,software application 242 executing on the member node could detect thelack of a unicast MJA from the multicast group leader after the membernode transmit a unicast MJR to the multicast group leader. In anotherexample, software application 242 executing on the member node coulddetermine that the member node has not received an MAM broadcasted bythe multicast group leader. This failure to receive the message may becaused by one or more asymmetric links between the member node and themulticast group leader.

Next, software application 242 forwards 604 a first broadcast messagethat includes an MJR from the member node to the multicast group leaderbased on a maximum hop limit. For example, software application 242executing on the member node could generate a broadcast MJR in responseto the lack of MAM or MJA from the multicast group leader. The membernode would forward the broadcast MJR to one or more direct neighbors,and each recipient of the broadcast MJR could further forward thebroadcast MJR to its direct neighbors until the maximum hop limit isreached.

Software application 242 also forwards 606, to the member node, a secondbroadcast message that includes an MJA generated by the multicast groupleader in response to the MJR. For example, software application 242executing on the multicast group leader could generate a broadcast MJAin response to the broadcast MJR from the member node. The multicastgroup leader would forward the broadcast MJA to one or more directneighbors, and each recipient of the broadcast MJA could further forwardthe broadcast MJA to its direct neighbors until a maximum hop limitassociated with the broadcast MJA is reached.

In some embodiments, the multicast group leader delays generation of thebroadcast MJA for a predetermined period to allow for receipt ofmultiple broadcast MJRs from different member nodes. The multicast groupleader then aggregates data related to MJAs for the multiple broadcastMJRs under a single broadcast message, and transmits the singlebroadcast message to other nodes in the mesh network for propagation tothe destination nodes of the MJAs.

Finally, software application adds 608 one or more nodes identified inthe MJA from the multicast group leader to the member node as multicastforwarders for the multicast group. For example, software application242 executing on the member node could use one or more address vectorsin the MJA to identify one or more nodes that are included in thepath(s). The member node and/or another component of the mesh networkcould then declare the identified node(s) as multicast forwarders forthe multicast group.

In sum, the disclosed techniques use a multicast discovery process toestablish communication within a multicast group of nodes included in amesh network. The multicast discovery process includes a three-wayhandshake between a multicast group leader in the multicast group andother member nodes in the multicast group. Nodes that are involved intransmitting messages between the multicast group leader and the othermember nodes during the three-way handshake are identified as multicastforwarders for the multicast group. When a message fails to betransmitted between a member node and the multicast group leader duringthe three-way handshake, broadcast transmission of one or more messagesin the three-way handshake is performed to find an alternative pathbetween the member node and the multicast group leader.

One technical advantage of the disclosed techniques relative to theprior art is that the disclosed techniques enable a minimum set ofmulticast forwarders to be identified within a multicast group, wherethe multicast forwarders in that minimum set are able to connect allmember nodes included in the multicast group. Accordingly, the disclosedtechniques are able to reduce bandwidth consumption and overallprocessing overhead typically associated with conventional approaches.The disclosed techniques also transmit unicast messages during themulticast discovery process when possible, which further reducesbandwidth consumption and processing overhead. These technicaladvantages provide one or more technological improvements over prior artapproaches.

1. In some embodiments, a method for establishing communication within amulticast group of nodes included in a mesh network comprises detectingthat a first message related to the member node joining the multicastgroup has not been received from a multicast group leader included inthe multicast group, in response, generating a first broadcast messagefor the member node that includes a multicast join request, andforwarding the first broadcast message to one or more nodes included inthe mesh network that are direct neighbors of the member node, whereinat least one node included in the one or more nodes further forwards thefirst broadcast message based on a first maximum hop limit.

2. The method of clause 1, further comprising receiving a secondbroadcast message that includes a first multicast join acknowledgmentgenerated by the multicast group leader in response to the multicastjoin request, and adding one or more additional nodes as one or moremulticast forwarders to the multicast group, wherein the one or moreadditional nodes reside along one or more paths used to transmit thefirst multicast join acknowledgment from the multicast group leader tothe member node.

3. The method of clauses 1 or 2, further comprising forwarding thesecond broadcast message to the one or more nodes based on a secondmaximum hop limit.

4. The method of any of clauses 1-3, further comprising aggregating thefirst multicast join acknowledgment and one or more additional multicastjoin acknowledgments generated by the multicast group leader under thesecond broadcast message.

5. The method of any of clauses 1-4, further comprising delayingtransmission of the second broadcast message from the multicast groupleader for a predetermined period, wherein during the predeterminedperiod, the multicast group leader processes one or more additionalmulticast join requests included in one or more additional broadcastmessages.

6. The method of any of clauses 1-5, wherein the first multicast joinacknowledgment includes a list of addresses in the one or more paths.

7. The method of any of clauses 1-6, wherein, when further forwardingthe first broadcast message, the at least one node decrements a hoplimit in the first broadcast message.

8. The method of any of clauses 1-7, wherein, when further forwardingthe first broadcast message, the at least one node adds an address ofthe at least one node to an address vector in the multicast joinrequest.

9. The method of any of clauses 1-8, wherein the first message comprisesa unicast message that includes a multicast join acknowledgment from themulticast group leader.

10. The method of any of clauses 1-9, wherein the first messagecomprises a multicast advertisement message from the multicast groupleader.

11. In some embodiments, a non-transitory computer readable mediumstores instructions that, when executed by a processor, cause theprocessor to perform the steps of detecting that a first message relatedto the member node joining the multicast group has not been receivedfrom a multicast group leader included in the multicast group, inresponse, generating a first broadcast message for the member node thatincludes a multicast join request, and forwarding the first broadcastmessage to one or more nodes included in the mesh network that aredirect neighbors of the member node, wherein at least one node includedin the one or more nodes further forwards the first broadcast messagebased on a first maximum hop limit.

12. The non-transitory computer readable medium of clause 11, whereinthe instructions further cause the processor to perform the steps ofreceiving a second broadcast message that includes a first multicastjoin acknowledgment generated by the multicast group leader in responseto the multicast join request, forwarding the second broadcast messageto the one or more nodes based on a second maximum hop limit, and addingone or more additional nodes as one or more multicast forwarders to themulticast group, wherein the one or more nodes reside along one or morepaths used to transmit the first multicast join acknowledgment from themulticast group leader to the member node.

13. The non-transitory computer readable medium of clauses 11 or 12,wherein the instructions further cause the processor to perform thesteps of delaying transmission of the second broadcast message from themulticast group leader for a predetermined period, and after thepredetermined period has lapsed, aggregating the first multicast joinacknowledgment and one or more additional multicast join acknowledgmentsgenerated by the multicast group leader under the second broadcastmessage.

14. The non-transitory computer readable medium of any of clauses 11-13,wherein the first multicast join acknowledgment includes a list ofaddresses in the one or more paths.

15. The non-transitory computer readable medium of any of clauses 11-14,wherein the one or more additional nodes are added as the one or moremulticast forwarders for a duration that is greater than a periodicityof a multicast advertisement message broadcasted by the multicast groupleader.

16. The non-transitory computer readable medium of any of clauses 11-15,wherein the one or more additional nodes comprise a first node that isnot a member of the multicast group.

17. The non-transitory computer readable medium of any of clauses 11-16,wherein, when further forwarding the first broadcast message, the atleast one node decrements a hop limit in the multicast join request andadds an address of the at least one node to an address vector in themulticast join request.

18. The non-transitory computer readable medium of any of clauses 11-17,wherein the first message comprises a multicast advertisement messagefrom the multicast group leader.

19. The non-transitory computer readable medium of any of clauses 11-18,wherein the first message comprises a unicast message that includes amulticast join acknowledgment from the multicast group leader.

20. In some embodiments, a system comprises a memory that storesinstructions, and a processor that is coupled to the memory and, whenexecuting the instructions, is configured to detect that a first messagerelated to the member node joining the multicast group has not beenreceived from a multicast group leader included in the multicast group,in response, generate a first broadcast message for the member node thatincludes a multicast join request, forward the first broadcast messageto one or more nodes included in the mesh network that are directneighbors of the member node, wherein at least one node included in theone or more nodes further forwards the first broadcast message based ona first maximum hop limit, receive a second broadcast message thatincludes a first multicast join acknowledgment generated by themulticast group leader in response to the multicast join request, andadd one or more additional nodes as one or more multicast forwarders tothe multicast group, wherein the one or more additional nodes residealong one or more paths used to transmit the first multicast joinacknowledgment from the multicast group leader to the member node.

Any and all combinations of any of the claim elements recited in any ofthe claims and/or any elements described in this application, in anyfashion, fall within the contemplated scope of the present invention andprotection.

The descriptions of the various embodiments have been presented forpurposes of illustration, but are not intended to be exhaustive orlimited to the embodiments disclosed. Many modifications and variationswill be apparent to those of ordinary skill in the art without departingfrom the scope and spirit of the described embodiments.

Aspects of the present embodiments may be embodied as a system, methodor computer program product. Accordingly, aspects of the presentdisclosure may take the form of an entirely hardware embodiment, anentirely software embodiment (including firmware, resident software,micro-code, etc.) or an embodiment combining software and hardwareaspects that may all generally be referred to herein as a “module,” a“system,” or a “computer.” In addition, any hardware and/or softwaretechnique, process, function, component, engine, module, or systemdescribed in the present disclosure may be implemented as a circuit orset of circuits. Furthermore, aspects of the present disclosure may takethe form of a computer program product embodied in one or more computerreadable medium(s) having computer readable program code embodiedthereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

Aspects of the present disclosure are described above with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of thedisclosure. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine. The instructions, when executed via the processor ofthe computer or other programmable data processing apparatus, enable theimplementation of the functions/acts specified in the flowchart and/orblock diagram block or blocks. Such processors may be, withoutlimitation, general purpose processors, special-purpose processors,application-specific processors, or field-programmable gate arrays.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present disclosure. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

While the preceding is directed to embodiments of the presentdisclosure, other and further embodiments of the disclosure may bedevised without departing from the basic scope thereof, and the scopethereof is determined by the claims that follow.

What is claimed is:
 1. A method for establishing communication within amulticast group of nodes included in a mesh network, the methodcomprising: detecting that a first message related to the member nodejoining the multicast group has not been received from a multicast groupleader included in the multicast group; in response, generating a firstbroadcast message for the member node that includes a multicast joinrequest; and forwarding the first broadcast message to one or more nodesincluded in the mesh network that are direct neighbors of the membernode, wherein at least one node included in the one or more nodesfurther forwards the first broadcast message based on a first maximumhop limit.
 2. The method of claim 1, further comprising: receiving asecond broadcast message that includes a first multicast joinacknowledgment generated by the multicast group leader in response tothe multicast join request; and adding one or more additional nodes asone or more multicast forwarders to the multicast group, wherein the oneor more additional nodes reside along one or more paths used to transmitthe first multicast join acknowledgment from the multicast group leaderto the member node.
 3. The method of claim 2, further comprisingforwarding the second broadcast message to the one or more nodes basedon a second maximum hop limit.
 4. The method of claim 2, furthercomprising aggregating the first multicast join acknowledgment and oneor more additional multicast join acknowledgments generated by themulticast group leader under the second broadcast message.
 5. The methodof claim 2, further comprising delaying transmission of the secondbroadcast message from the multicast group leader for a predeterminedperiod, wherein during the predetermined period, the multicast groupleader processes one or more additional multicast join requests includedin one or more additional broadcast messages.
 6. The method of claim 2,wherein the first multicast join acknowledgment includes a list ofaddresses in the one or more paths.
 7. The method of claim 1, wherein,when further forwarding the first broadcast message, the at least onenode decrements a hop limit in the first broadcast message.
 8. Themethod of claim 1, wherein, when further forwarding the first broadcastmessage, the at least one node adds an address of the at least one nodeto an address vector in the multicast join request.
 9. The method ofclaim 1, wherein the first message comprises a unicast message thatincludes a multicast join acknowledgment from the multicast groupleader.
 10. The method of claim 1, wherein the first message comprises amulticast advertisement message from the multicast group leader.
 11. Anon-transitory computer readable medium storing instructions that, whenexecuted by a processor, cause the processor to perform the steps of:detecting that a first message related to the member node joining themulticast group has not been received from a multicast group leaderincluded in the multicast group; in response, generating a firstbroadcast message for the member node that includes a multicast joinrequest; and forwarding the first broadcast message to one or more nodesincluded in the mesh network that are direct neighbors of the membernode, wherein at least one node included in the one or more nodesfurther forwards the first broadcast message based on a first maximumhop limit.
 12. The non-transitory computer readable medium of claim 11,wherein the instructions further cause the processor to perform thesteps of: receiving a second broadcast message that includes a firstmulticast join acknowledgment generated by the multicast group leader inresponse to the multicast join request; forwarding the second broadcastmessage to the one or more nodes based on a second maximum hop limit;and adding one or more additional nodes as one or more multicastforwarders to the multicast group, wherein the one or more nodes residealong one or more paths used to transmit the first multicast joinacknowledgment from the multicast group leader to the member node. 13.The non-transitory computer readable medium of claim 12, wherein theinstructions further cause the processor to perform the steps of:delaying transmission of the second broadcast message from the multicastgroup leader for a predetermined period; and after the predeterminedperiod has lapsed, aggregating the first multicast join acknowledgmentand one or more additional multicast join acknowledgments generated bythe multicast group leader under the second broadcast message.
 14. Thenon-transitory computer readable medium of claim 12, wherein the firstmulticast join acknowledgment includes a list of addresses in the one ormore paths.
 15. The non-transitory computer readable medium of claim 12,wherein the one or more additional nodes are added as the one or moremulticast forwarders for a duration that is greater than a periodicityof a multicast advertisement message broadcasted by the multicast groupleader.
 16. The non-transitory computer readable medium of claim 12,wherein the one or more additional nodes comprise a first node that isnot a member of the multicast group.
 17. The non-transitory computerreadable medium of claim 11, wherein, when further forwarding the firstbroadcast message, the at least one node decrements a hop limit in themulticast join request and adds an address of the at least one node toan address vector in the multicast join request.
 18. The non-transitorycomputer readable medium of claim 11, wherein the first messagecomprises a multicast advertisement message from the multicast groupleader.
 19. The non-transitory computer readable medium of claim 11,wherein the first message comprises a unicast message that includes amulticast join acknowledgment from the multicast group leader.
 20. Asystem, comprising: a memory that stores instructions, and a processorthat is coupled to the memory and, when executing the instructions, isconfigured to: detect that a first message related to the member nodejoining the multicast group has not been received from a multicast groupleader included in the multicast group; in response, generate a firstbroadcast message for the member node that includes a multicast joinrequest; forward the first broadcast message to one or more nodesincluded in the mesh network that are direct neighbors of the membernode, wherein at least one node included in the one or more nodesfurther forwards the first broadcast message based on a first maximumhop limit; receive a second broadcast message that includes a firstmulticast join acknowledgment generated by the multicast group leader inresponse to the multicast join request; and add one or more additionalnodes as one or more multicast forwarders to the multicast group,wherein the one or more additional nodes reside along one or more pathsused to transmit the first multicast join acknowledgment from themulticast group leader to the member node.